2

A minimum-area circuit forl-selection

Year:
1987
Language:
english
File:
PDF, 768 KB
english, 1987
4

The Crossing Number of a Graph on a Compact 2-Manifold

Year:
1996
Language:
english
File:
PDF, 478 KB
english, 1996
5

Parallel quicksort

Year:
1991
Language:
english
File:
PDF, 583 KB
english, 1991
6

Dynamic faults have small effect on broadcasting in hypercubes

Year:
2004
Language:
english
File:
PDF, 165 KB
english, 2004
7

Bisecting de Bruijn and Kautz graphs

Year:
1998
Language:
english
File:
PDF, 675 KB
english, 1998
8

New results on edge-bandwidth

Year:
2003
Language:
english
File:
PDF, 296 KB
english, 2003
10

On crossing numbers of hypercubes and cube connected cycles

Year:
1993
Language:
english
File:
PDF, 323 KB
english, 1993
11

Semelectivity is not sufficient

Year:
1991
Language:
english
File:
PDF, 672 KB
english, 1991
12

Edge separators for graphs of bounded genus with applications

Year:
1993
Language:
english
File:
PDF, 604 KB
english, 1993
13

On Embeddings in Cycles

Year:
1995
File:
PDF, 287 KB
1995
14

Tight chip area lower bounds for string matching

Year:
1987
Language:
english
File:
PDF, 134 KB
english, 1987
15

The area-time complexity of the VLSI counter

Year:
1987
Language:
english
File:
PDF, 208 KB
english, 1987
16

Virtual Path Layouts in ATM Networks

Year:
2000
Language:
english
File:
PDF, 164 KB
english, 2000
17

IMPROVED BOUNDS ON CUTWIDTHS OF SHUFFLE-EXCHANGE AND DE BRUIJN GRAPHS

Year:
2004
Language:
english
File:
PDF, 526 KB
english, 2004
18

OPTIMAL BROADCASTING IN TORI WITH DYNAMIC FAULTS

Year:
2002
Language:
english
File:
PDF, 717 KB
english, 2002
19

PERMUTATION COMMUNICATION IN ALL-OPTICAL RINGS

Year:
2002
Language:
english
File:
PDF, 930 KB
english, 2002
21

Cutwidth of the r -dimensional Mesh of d -ary Trees

Year:
2000
Language:
english
File:
PDF, 109 KB
english, 2000